Proof of Four Color Map Theorem by Using PRN of Graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal Proof—The Four- Color Theorem

The Tale of a Brainteaser Francis Guthrie certainly did it, when he coined his innocent little coloring puzzle in 1852. He managed to embarrass successively his mathematician brother, his brother’s professor, Augustus de Morgan, and all of de Morgan’s visitors, who couldn’t solve it; the Royal Society, who only realized ten years later that Alfred Kempe’s 1879 solution was wrong; and the three ...

متن کامل

A Human-Checkable Four-Color Theorem Proof

This paper presents a short and simple proof of the Four-Color Theorem, which can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has permitted it is presented in the Introduction. Mathematics Subject Classification (2010). Primary 05C10; Secondary 05C15.

متن کامل

On the Four-color-map Theorem

Coloring planar Feynman diagrams in spinor quantum electrodynamics, is a non trivial model soluble without computer. Four colors are necessary and sufficient.

متن کامل

A Simple Proof of the Four-Color Theorem

A simpler proof of the four color theorem is presented. The proof was reached using a series of equivalent theorems. First the maximum number of edges of a planar graph is obatined as well as the minimum number of edges for a complete graph. Then it is shown that for the theorem to be false there must exist a complete planar graph of h edges such that h > 4. Finally the theorem is proved to be ...

متن کامل

A formal proof of the four color theorem

A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color theorem. Why? A bad idea, we think, directed people to a rough road. Using a similar method to that for the formal proof of the five color theorem, a formal proof is proposed in this paper of the four color theorem, namely, every planar graph is four-colorable. The forma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Bulletin of Society for Mathematical Services and Standards

سال: 2014

ISSN: 2277-8020

DOI: 10.18052/www.scipress.com/bsmass.11.26